Measuring concurrency using a joint multistate and point process model for retrospective sexual history data
نویسندگان
چکیده
منابع مشابه
Joint model with latent state for longitudinal and multistate data.
In many chronic diseases, the patient's health status is followed up by quantitative markers. The evolution is often characterized by a 2-phase degradation process, that is, a normal phase followed by a pathological degradation phase preceding the disease diagnosis. We propose a joint multistate model with latent state for the joint modeling of repeated measures of a quantitative marker, time-t...
متن کاملA Monotone Process Maintenance Model for a Multistate System
In this paper, we study a monotone process maintenance model for a multistate system with k working states and failure states. By making different assumptions, we can apply the model to a multistate deteriorating system as well as to a multistate improving system. We show that the monotone process model for a multistate system is equivalent to a geometric process model for a two-state system. T...
متن کاملMultistate Markov Models for Analyzing Incomplete Life History Data
PAl-LIEN CHEN. Multistate Markov Models for Ana.!yzing Incomplete Life History Data. (Under the direction of Dr. Pranab Kumar Sen.) In most follow-up studies, there may be several types of events or states that characterize individuals experience, and their transition or occurrence rates are of interest. However, owing to the periodic nature of the observations, the information of the transitio...
متن کاملA multistate model for bivariate interval-censored failure time data.
SUMMARY Interval-censored life-history data arise when the events of interest are only detectable at periodic assessments. When interest lies in the occurrence of two such events, bivariate-interval censored event time data are obtained. We describe how to fit a four-state Markov model useful for characterizing the association between two interval-censored event times when the assessment times ...
متن کاملReasoning about Optimistic Concurrency Using a Program Logic for History
Optimistic concurrency algorithms provide good performance for parallel programs but they are extremely hard to reason about. Program logics such as concurrent separation logic and rely-guarantee reasoning can be used to verify these algorithms, but they make heavy uses of history variables which may obscure the high-level intuition underlying the design of these algorithms. In this paper, we p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics in Medicine
سال: 2016
ISSN: 0277-6715,1097-0258
DOI: 10.1002/sim.7013